Solving generation expansion planning problems with environmental constraints by a bundle method
نویسندگان
چکیده
منابع مشابه
Solving generation expansion planning problems with environmental constraints by a bundle method
We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement functio...
متن کاملIntroducing environmental constraints in generation expansion problems
Generation expansion planning problems should take into account not only satisfaction of future demand but also environmental constraints, such as government imposed limits on pollution produced by coal based power plants. For a vertically integrated system of power plants, we model those features as a two-stage stochastic programming problem with recourse that can be solved by decomposition me...
متن کاملA multilevel ACO approach for solving forest transportation planning problems with environmental constraints
This paper presents a multilevel ant colony optimization (MLACO) approach to solve constrained forest transportation planning problems (CFTPPs). A graph coarsening technique is used to coarsen a network representing the problem into a set of increasingly coarser level problems. Then, a customized ant colony optimization (ACO) algorithm is designed to solve the CFTPP from coarser to finer level ...
متن کاملA Bundle Interior Proximal Method for Solving Convex Minimization Problems
In this paper we extend the standard bundle proximal method for finding the minimum of a convex not necessarily differentiable function on the nonnegative orthant. The strategy consists in approximating the objective function by a piecewise linear convex function and using distance–like functions based on second order homogeneous kernels. First we prove the convergence of this new bundle interi...
متن کاملA Bundle Method for Solving Convex Non-smooth Minimization Problems
Numerical experiences show that bundle methods are very efficient for solving convex non-smooth optimization problems. In this paper we describe briefly the mathematical background of a bundle method and discuss practical aspects for the numerical implementation. Further, we give a detailed documentation of our implementation and report about numerical tests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Management Science
سال: 2012
ISSN: 1619-697X,1619-6988
DOI: 10.1007/s10287-012-0139-1